Rank and Conjugation for the Frobenius Representation of an Overpartition
نویسنده
چکیده
We discuss conjugation and Dyson’s rank for overpartitions from the perspective of the Frobenius representation. More specifically, we translate the classical definition of Dyson’s rank to the Frobenius representation of an overpartition and define a new kind of conjugation in terms of this representation. We then use q-series identities to study overpartitions that are self-conjugate with respect to this conjugation.
منابع مشابه
Rank and Conjugation for a Second Frobenius Representation of an Overpartition
The notions of rank and conjugation are developed in the context of a second Frobenius representation of an overpartition. Some identities for overpartitions that are invariant under this conjugation are presented.
متن کاملFrobenius kernel and Wedderburn's little theorem
We give a new proof of the well known Wedderburn's little theorem (1905) that a finite division ring is commutative. We apply the concept of Frobenius kernel in Frobenius representation theorem in finite group theory to build a proof.
متن کاملRank and Congruences for Overpartition Pairs
The rank of an overpartition pair is a generalization of Dyson’s rank of a partition. The purpose of this paper is to investigate the role that this statistic plays in the congruence properties of pp(n), the number of overpartition pairs of n. Some generating functions and identities involving this rank are also presented.
متن کاملOverpartition Theorems of the Rogers-ramanujan Type
We give one-parameter overpartition-theoretic analogues of two classical families of partition identities: Andrews’ combinatorial generalization of the Gollnitz-Gordon identities and a theorem of Andrews and Santos on partitions with attached odd parts. We also discuss geometric counterparts arising from multiple q-series identities. These involve representations of overpartitions in terms of g...
متن کاملDeep Unsupervised Domain Adaptation for Image Classification via Low Rank Representation Learning
Domain adaptation is a powerful technique given a wide amount of labeled data from similar attributes in different domains. In real-world applications, there is a huge number of data but almost more of them are unlabeled. It is effective in image classification where it is expensive and time-consuming to obtain adequate label data. We propose a novel method named DALRRL, which consists of deep ...
متن کامل